Interactive Learning Based Realizability and 1-Backtracking Games
نویسنده
چکیده
We prove that interactive learning based classical realizability (introduced by Aschieri and Berardi for first order arithmetic [1]) is sound with respect to Coquand game semantics. In particular, any realizer of an implication-and-negation-free arithmetical formula embodies a winning recursive strategy for the 1-Backtracking version of Tarski games. We also give examples of realizer and winning strategy extraction for some classical proofs. We also sketch some ongoing work about how to extend our notion of realizability in order to obtain completeness with respect to Coquand semantics, when it is restricted to 1-Backtracking games.
منابع مشابه
Learning based realizability for HA + EM1 and 1-Backtracking games: Soundness and completeness
We prove a soundness and completeness result for Aschieri and Berardi’s learning based realizability for Heyting Arithmetic plus Excluded Middle over semi-decidable statements with respect to 1-Backtracking Coquand game semantics. First, we prove that learning based realizability is sound with respect to 1Backtracking Coquand game semantics. In particular, any realizer of an implication-and-neg...
متن کاملInterpreting a Classical Geometric Proof with Interactive Realizability
We show how to extract a monotonic learning algorithm from a classical proof of a geometric statement by interpreting the proof by means of interactive realizability, a realizability sematics for classical logic. The statement is about the existence of a convex angle including a finite collections of points in the real plane and it is related to the existence of a convex hull. We define real nu...
متن کاملBilateral Teleoperation Systems Using Backtracking Search optimization Algorithm Based Iterative Learning Control
This paper deals with the application of Iterative Learning Control (ILC) to further improve the performance of teleoperation systems based on Smith predictor. The goal is to achieve robust stability and optimal transparency for these systems. The proposed control structure make the slave manipulator follow the master in spite of uncertainties in time delay in communication channel and model pa...
متن کاملInteractive Learning-Based Realizability for Heyting Arithmetic with EM1
We apply to the semantics of Arithmetic the idea of “finite approximation” used to provide computational interpretations of Herbrand’s Theorem, and we interpret classical proofs as constructive proofs (with constructive rules for ∨, ∃) over a suitable structure N for the language of natural numbers and maps of Gödel’s system T . We introduce a new Realizability semantics we call “Interactive le...
متن کاملInteractive Realizability for Classical Peano Arithmetic with Skolem Axioms
Interactive realizability is a computational semantics of classical Arithmetic. It is based on interactive learning and was originally designed to interpret excluded middle and Skolem axioms for simple existential formulas. A realizer represents a proof/construction depending on some state, which is an approximation of some Skolem functions. The realizer interacts with the environment, which ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010